RS-Algo: an Algorithm for Improved Memory Utilization in Continuous Query System under Asynchronous Data Streams

نویسندگان

  • Nithya Vijayakumar
  • Beth Plale
چکیده

Continuous query systems are an intuitive way for users to access data streaming data in large scale scientific applications containing hundreds if not thousands of streams. This paper focuses on optimizations for improved memory utilization under the large scale, asynchronous streams found in on-demand meteorological forecasting and other data-driven applications. Specifically, we experimentally evaluate the RS-Algo algorithm for dynamically adjusting sliding window sizes used in database joins to reflect current stream rates. In this TR we provide detailed results of measurements of the RS-Algo algorithm which dynamically adjusts the sliding window sizes used in database joins to reflect current stream rates. We tested under various queries and stream rate conditions using a synthetic workloads and using the dQUOB continuous query system. We examine service time and memory utilization. The second result chronicles a smaller experiment comparing two algorithms used during runtime to schedule events. We evaluated the performance of the existing algorithm, First Come First Serve (FCFS), against a modified version of Earliest Job First (EJF) and examined the impact on memory utilization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monitoring Stream Properties for Continuous Query Processing

We are developing a general-purpose Data Stream Management System for processing continuous queries over multiple continuous data streams [MW 03]. When a new continuous query is registered, our query optimizer creates an initial query plan (possibly merged with existing plans for previously registered queries), and allocates initial resources, such as memory for join or aggregation synopses [GG...

متن کامل

ارائه روشی پویا جهت پاسخ به پرس‌وجوهای پیوسته تجمّعی اقتضایی

Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...

متن کامل

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

MobiPLACE*: A Distributed Framework for Spatio-Temporal Data Streams Processing Utilizing Mobile Clients' Processing Power

The problem of continuous spatio-temporal queries’ processing was addressed by many papers. Some papers introduced solutions using single server architecture while others using distributed server one. In this paper, we introduce MobiPLACE*, an extension to PLACE* [13] system, a distributed framework for spatio-temporal data streams processing exploiting mobile clients’ processing power. We will...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004